Fluent Merging for Classical Planning Problems
نویسندگان
چکیده
Fluent merging is a reformulation technique for classical planning problems that can be applied automatically or semiautomatically. The reformulation strives to transform a planning task into a representation that allows a planning algorithm to find solutions more efficiently or to find solutions of better quality. This work introduces different approaches for fluent merging and evaluates them within a state-of-the-art planning system.
منابع مشابه
Fluent Merging: A General Technique to Improve Reachability Heuristics and Factored Planning
Fluent merging is the process of combining two or more fluents (state variables) into a single “super” fluent. By compiling in some of the inter-fluent interactions, fluent merging can (1) help improve informedness of relaxed reachability heuristics, and (2) improve the efficiency of factored planning as it removes some of the intervariable dependencies. Although some special cases of fluent me...
متن کاملSolving Planning Problems by Partial Deduction
We develop an abstract partial deduction method capable of solving planning problems in the Fluent Calculus. To this end, we extend \classical" partial deduction to accommodate both, equational theories and regular type information. We show that our new method is actually complete for conjunctive planning problems in the propositional Fluent Calculus. Furthermore, we believe that our approach c...
متن کاملMonotone Temporal Planning :
Wedescribe apolynomially-solvable class of temporal planning problems. Polynomiality follows from two assumptions. Firstly, by supposing that each fluent (fact) can be established by at most one action, we can quickly determine which actions are necessary in any plan. Secondly, the monotonicity of fluents allows us to express planning as an instance of STP (Simple Temporal Problemwith differenc...
متن کاملMAP-LAPKT: Omnipotent Multi-Agent Planning via Compilation to Classical Planning
The general approach is quite simple: we convert the unfactored domain and problem file into a classical planning problem such that the privacy of fluents and objects are respected. The translation is both sound and complete, and we solve the encoded problem using a centralized classical planner. None of the factorization is passed to the classical planner, because the encoded problem contains ...
متن کاملContingency Planning in Linear Time Logic
The “planning as satisfiability” approach for classical planning establishes a correspondence between planning problems and logical theories, and, consequently, between plans and models. This work proposes a similar framework for contingency planning: considering contingent planning problems where the sources of indeterminism are incomplete knowledge about the initial state, non-inertial fluent...
متن کامل